Randomized algorithm - PDFSEARCH.IO - Document Search Engine

Randomized algorithm
Results: 630

#	Item
201	Online Bipartite Perfect Matching With Augmentations Kamalika Chaudhuri∗ , Constantinos Daskalakis† , Robert D. Kleinberg‡ , and Henry Lin† ∗ Information Theory and Applications Center, U.C. San Diego Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2011-01-01 02:41:47 Analysis of algorithms Combinatorial optimization Matching Randomized algorithm Load balancing Server SL Big O notation Hopcroft–Karp algorithm Theoretical computer science Computational complexity theory Mathematics
202	Optimal-Time Adaptive Strong Renaming, with Applications to Counting [Extended Abstract] Dan Alistarh ∗ EPFL Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:10 Sorting algorithms Computational complexity theory Analysis of algorithms Algorithm Mathematical logic Randomized algorithm Time complexity Consensus Sorting network Theoretical computer science Applied mathematics Mathematics
203	CURRICULUM VITAE Michael T. Goodrich Dept. of Computer Science Bren School of Info. & Computer Sciences University of California, Irvine Irvine, CA Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2015-05-08 17:28:58 Discrete geometry Year of birth missing Michael T. Goodrich David Eppstein Journal of Graph Algorithms and Applications Straight skeleton Algorithm Randomized algorithm Voronoi diagram Mathematics Geometry Computational geometry
204	The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-10-26 12:29:22 NP-complete problems Analysis of algorithms Combinatorial optimization Matching Spanning tree Planar graph Nearest neighbor search Connectivity Randomized algorithm Graph theory Theoretical computer science Mathematics
205	Limits and Applications of Group Algebras for Parameterized Problems Ioannis Koutis Computer Science Department Carnegie Mellon University Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:56:28 Analysis of algorithms Polynomials Algebraic geometry Commutative algebra Parameterized complexity XTR Kernelization Randomized algorithm Time complexity Theoretical computer science Mathematics Computational complexity theory
206	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Analysis of algorithms Triangulation Computational complexity theory Time complexity Algorithm Randomized algorithm Big O notation Delaunay triangulation Planar separator theorem Theoretical computer science Mathematics Applied mathematics
207	A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:37 NP-complete problems Combinatorics Analysis of algorithms Set packing Randomized algorithm Disjoint-set data structure Parameterized complexity Set cover problem Dominating set Theoretical computer science Computational complexity theory Mathematics
208	Partial Information Spreading with Application to Distributed Maximum Coverage Keren Censor Hillel∗ and Hadas Shachnai† Department of Computer Science, Technion Haifa 32000, Israel February 18, 2010 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-02-18 13:16:53 Probability theory Algebraic graph theory Network flow Conductance Matrices Connectivity Randomized algorithm Degree Flow network Graph theory Mathematics Theoretical computer science
209	70 CHAPTER 7. MAXIMAL INDEPENDENT SET Remarks: • Computing a maximum independent set (MaxIS) is a notoriously difficult Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Combinatorial optimization NP-complete problems Routing algorithms Search algorithms Matching Randomized algorithm Graph coloring Connectivity Dominating set Mathematics Theoretical computer science Graph theory
210	Representative Families: A Unified Tradeoff-Based Approach Hadas Shachnai and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {hadas,meizeh}@cs.technion.ac.il Abstract. Let M = (E, I) be a mat Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-04-27 19:17:21 Dominating set Polynomials Randomized algorithm Dynamic programming Sheaf Push-relabel maximum flow algorithm Tree decomposition Mathematics Theoretical computer science Applied mathematics

UPDATE